Operation Systems with Discretionary Task Completion

نویسندگان

  • Gigi Yuen
  • Wallace J. Hopp
  • Seyed M.R. Iravani
چکیده

Most performance evaluation models in operations management literature have assumed that tasks possess standardized completion criteria. However, in many operation systems, particularly in service and professional work, judgment is frequently required to determine when a task is completed. In thin paper, we show that introducing discretion in task completion adds a fourth variability buffer, quality, to the well known buffers of capacity, inventory and time. To gain insight into the managerial implications of this difference, we model the work of a single worker system with discretionary task completion as a controlled queue. After characterizing the optimal control policy and identifying identifying some practical heuristics, we use this model to examine the differences between discretionary and non-discretionary work. We show that adding capacity may actually increase congestion in systems with discretionary task completion, and information about job types in queue is less useful in systems with discretionary task completion than in systems with non-discretionary task completion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Operations Systems with Discretionary Task Completion

Most performance evaluation models in operations management literature have assumed that tasks possess standardized completion criteria. However, in many operation systems, particularly in service and professional work, judgment is frequently required to determine when a task is completed. In thin paper, we show that introducing discretion in task completion adds a fourth variability buffer, qu...

متن کامل

Discretionary task interleaving RUNNING HEAD: DISCRETIONARY TASK INTERLEAVING Discretionary task interleaving: Heuristics for time allocation in cognitive foraging

When participants allocated time across two tasks (in which they generated as many words as possible from a fixed set of letters) they made frequent switches. This allowed them to allocate more time to the more productive task (i.e. the set of letters from which more words could be generated), even though times between the last word and the switch decision (“giving-up times”) were higher in the...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

ONLINE APPENDIX for Operations Systems with Discretionary Task Completion

• Decision epochs are the beginning of every period. • Action space includes Keep (K), Release & Work (RW), Release & Idle (RI) and Idle (I) for each server. The 16 unique combinations of the two workers’ actions constitute the system’s action space. Action “Keep” requires the worker to continue working on the current job for one more period. Action “Release & Work” requires that the worker sto...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005